Radix tree

Results: 48



#Item
11Introduction to Computing: Explorations in Language, Logic, and Machines

Introduction to Computing: Explorations in Language, Logic, and Machines

Add to Reading List

Source URL: www.computingbook.org

Language: English - Date: 2011-08-19 11:52:42
12Approximate Orthogonal Range Search using Patricia Tries Bradford G. Nickerson ∗  range

Approximate Orthogonal Range Search using Patricia Tries Bradford G. Nickerson ∗ range

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2005-07-31 13:55:55
13CCCG 2004, Montreal, Quebec, August 9–11, 2004  Tries for combined text and spatial data range search  Qingxiu Shi

CCCG 2004, Montreal, Quebec, August 9–11, 2004 Tries for combined text and spatial data range search  Qingxiu Shi

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2004-08-23 15:27:23
14Technology  The Index The ScaleDB technology is based on a compressed form of tries called Patricia tries. A Patricia trie differs from a standard trie in that nodes with one child are compressed into their parent node,

Technology The Index The ScaleDB technology is based on a compressed form of tries called Patricia tries. A Patricia trie differs from a standard trie in that nodes with one child are compressed into their parent node,

Add to Reading List

Source URL: scaledb.com

Language: English - Date: 2014-06-24 22:17:50
15RadixVM: Scalable address spaces for multithreaded applications Austin T. Clements, M. Frans Kaashoek, and Nickolai Zeldovich MIT CSAIL A BSTRACT

RadixVM: Scalable address spaces for multithreaded applications Austin T. Clements, M. Frans Kaashoek, and Nickolai Zeldovich MIT CSAIL A BSTRACT

Add to Reading List

Source URL: pdos.csail.mit.edu

Language: English - Date: 2015-04-29 10:31:16
16High Performance GraphicsC. Dachsbacher, J. Munkberg, and J. Pantaleoni (Editors) Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees Tero Karras

High Performance GraphicsC. Dachsbacher, J. Munkberg, and J. Pantaleoni (Editors) Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees Tero Karras

Add to Reading List

Source URL: devblogs.nvidia.com

Language: English - Date: 2015-01-29 19:09:45
17 	
  	
    	
      	
  

           

Add to Reading List

Source URL: cuba.coventry.ac.uk

Language: English - Date: 2013-02-27 05:50:34
18Dynamic Pipelining: Making IP-Lookup Truly Scalable Jahangir Hasan T. N. Vijaykumar  {hasanj, vijay} @ecn.purdue.edu

Dynamic Pipelining: Making IP-Lookup Truly Scalable Jahangir Hasan T. N. Vijaykumar {hasanj, vijay} @ecn.purdue.edu

Add to Reading List

Source URL: conferences.sigcomm.org

Language: English - Date: 2005-07-14 13:20:18
19Flattened Butterfly : A Cost-Efficient Topology for High-Radix Networks John Kim, William J. Dally Dennis Abts

Flattened Butterfly : A Cost-Efficient Topology for High-Radix Networks John Kim, William J. Dally Dennis Abts

Add to Reading List

Source URL: cva.stanford.edu

Language: English - Date: 2007-04-03 18:23:10
20Linear Work Suffix Array Construction Juha K¨arkk¨ainen∗ Peter Sanders†  Stefan Burkhardt‡

Linear Work Suffix Array Construction Juha K¨arkk¨ainen∗ Peter Sanders† Stefan Burkhardt‡

Add to Reading List

Source URL: www.cs.helsinki.fi

Language: English - Date: 2005-04-19 08:55:49